Bayesian Trend Filtering via Proximal Markov Chain Monte Carlo

نویسندگان

چکیده

Proximal Markov chain Monte Carlo is a novel construct that lies at the intersection of Bayesian computation and convex optimization, which helped popularize use nondifferentiable priors in statistics. Existing formulations proximal MCMC, however, require hyperparameters regularization parameters to be prespecified. In this article, we extend paradigm MCMC through introducing new class called epigraph priors. As proof concept, place trend filtering, was originally nonparametric regression problem, parametric setting provide posterior median fit along with credible intervals as measures uncertainty. The key idea replace nonsmooth term density its Moreau-Yosida envelope, enables application gradient-based sampler Hamiltonian Carlo. proposed method identifies appropriate amount smoothing data-driven way, thereby automating parameter selection. Compared conventional methods, our mostly tuning free, achieving simultaneous calibration mean, scale fully framework. Supplementary materials for article are available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian Computation Via Markov Chain Monte Carlo

A search for Markov chain Monte Carlo (or MCMC) articles on Google Scholar yields over 100,000 hits, and a general web search on Google yields 1.7 million hits. These results stem largely from the ubiquitous use of these algorithms in modern computational statistics, as we shall now describe. MCMC algorithms are used to solve problems in many scientific fields, including physics (where many MCM...

متن کامل

Bayesian system identification via Markov chain Monte Carlo techniques

The work here explores new numerical methods for supporting a Bayesian approach to parameter estimation of dynamic systems. This is primarily motivated by the goal of providing accurate quantification of estimation error that is valid for arbitrary, and hence even very short length data records. The main innovation is the employment of the Metropolis–Hastings algorithm to construct an ergodic M...

متن کامل

Bayesian Inference for PCFGs via Markov Chain Monte Carlo

This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an alternative to maximum-likelihood estimation using the Inside-Outside algorithm. We illustrate these methods by estimating a sparse grammar describing the morphology of the Bantu language Sesotho, demonstrating that with sui...

متن کامل

Bayesian phylogenetic inference via Markov chain Monte Carlo methods.

We derive a Markov chain to sample from the posterior distribution for a phylogenetic tree given sequence information from the corresponding set of organisms, a stochastic model for these data, and a prior distribution on the space of trees. A transformation of the tree into a canonical cophenetic matrix form suggests a simple and effective proposal distribution for selecting candidate trees cl...

متن کامل

Bayesian Generalised Ensemble Markov Chain Monte Carlo

Bayesian generalised ensemble (BayesGE) is a new method that addresses two major drawbacks of standard Markov chain Monte Carlo algorithms for inference in highdimensional probability models: inapplicability to estimate the partition function and poor mixing properties. BayesGE uses a Bayesian approach to iteratively update the belief about the density of states (distribution of the log likelih...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2023

ISSN: ['1061-8600', '1537-2715']

DOI: https://doi.org/10.1080/10618600.2023.2170089